crypto/internal/fips140/bigmod.Nat.limbs (field)
113 uses
crypto/internal/fips140/bigmod (current package)
nat.go#L59: limbs []uint
nat.go#L78: if len(x.limbs) > n {
nat.go#L81: if cap(x.limbs) < n {
nat.go#L83: copy(newLimbs, x.limbs)
nat.go#L84: x.limbs = newLimbs
nat.go#L87: extraLimbs := x.limbs[len(x.limbs):n]
nat.go#L89: x.limbs = x.limbs[:n]
nat.go#L95: if cap(x.limbs) < n {
nat.go#L96: x.limbs = make([]uint, n)
nat.go#L100: clear(x.limbs[:max(n, len(x.limbs))])
nat.go#L101: x.limbs = x.limbs[:n]
nat.go#L122: for i := len(x.limbs) - 1; i >= 0; i-- {
nat.go#L123: if x.limbs[i] != 0 {
nat.go#L126: x.limbs = x.limbs[:i]
nat.go#L133: x.reset(len(y.limbs))
nat.go#L134: copy(x.limbs, y.limbs)
nat.go#L142: return x.limbs
nat.go#L152: for _, limb := range x.limbs {
nat.go#L198: if bitLen(x.limbs[len(x.limbs)-1]) > bitLen(m.nat.limbs[len(m.nat.limbs)-1]) {
nat.go#L216: for k < len(x.limbs) && i >= _S {
nat.go#L217: x.limbs[k] = bigEndianUint(b[i-_S : i])
nat.go#L221: for s := 0; s < _W && k < len(x.limbs) && i > 0; s += 8 {
nat.go#L222: x.limbs[k] |= uint(b[i-1]) << s
nat.go#L236: x.limbs[0] = y
nat.go#L247: size := len(x.limbs)
nat.go#L248: xLimbs := x.limbs[:size]
nat.go#L249: yLimbs := y.limbs[:size]
nat.go#L263: size := len(x.limbs)
nat.go#L264: xLimbs := x.limbs[:size]
nat.go#L278: size := len(x.limbs)
nat.go#L279: xLimbs := x.limbs[:size]
nat.go#L306: if len(x.limbs) == 0 {
nat.go#L309: return choice(x.limbs[0] & 1)
nat.go#L315: limbs := x.limbs
nat.go#L334: size := len(x.limbs)
nat.go#L335: xLimbs := x.limbs[:size]
nat.go#L336: yLimbs := y.limbs[:size]
nat.go#L354: size := len(x.limbs)
nat.go#L355: xLimbs := x.limbs[:size]
nat.go#L356: yLimbs := y.limbs[:size]
nat.go#L372: size := len(x.limbs)
nat.go#L373: xLimbs := x.limbs[:size]
nat.go#L374: yLimbs := y.limbs[:size]
nat.go#L389: size := len(x.limbs)
nat.go#L390: xLimbs := x.limbs[:size]
nat.go#L391: yLimbs := y.limbs[:size]
nat.go#L406: size := len(x.limbs)
nat.go#L407: xLimbs := x.limbs[:size]
nat.go#L438: size := len(x.limbs)
nat.go#L439: xLimbs := x.limbs[:size]
nat.go#L483: n := uint(len(rr.limbs))
nat.go#L489: rr.limbs[n-1] = 1 << ((mLen - 1) % _W)
nat.go#L563: n := NewNat().reset(len(x.limbs) + len(y.limbs))
nat.go#L564: for i := range y.limbs {
nat.go#L565: n.limbs[i+len(x.limbs)] = addMulVVW(n.limbs[i:i+len(x.limbs)], x.limbs, y.limbs[i])
nat.go#L577: m.m0inv = minusInverseModW(m.nat.limbs[0])
nat.go#L611: size := len(m.nat.limbs)
nat.go#L612: xLimbs := x.limbs[:size]
nat.go#L613: dLimbs := d.limbs[:size]
nat.go#L614: mLimbs := m.nat.limbs[:size]
nat.go#L655: i := len(x.limbs) - 1
nat.go#L658: start := len(m.nat.limbs) - 2
nat.go#L663: out.limbs[j] = x.limbs[i]
nat.go#L668: out.shiftIn(x.limbs[i], m)
nat.go#L678: return x.expand(len(m.nat.limbs))
nat.go#L685: return out.reset(len(m.nat.limbs))
nat.go#L728: one.limbs[0] = 1
nat.go#L768: one.limbs[0] = 1
nat.go#L780: n := len(m.nat.limbs)
nat.go#L781: mLimbs := m.nat.limbs[:n]
nat.go#L782: aLimbs := a.limbs[:n]
nat.go#L783: bLimbs := b.limbs[:n]
nat.go#L844: copy(x.reset(n).limbs, T[n:])
nat.go#L862: copy(x.reset(n).limbs, T[n:])
nat.go#L876: copy(x.reset(n).limbs, T[n:])
nat.go#L890: copy(x.reset(n).limbs, T[n:])
nat.go#L932: n := len(m.nat.limbs)
nat.go#L933: xLimbs := x.limbs[:n]
nat.go#L934: yLimbs := y.limbs[:n]
nat.go#L951: return x.Mod(&Nat{limbs: T}, m)
nat.go#L961: return x.Mod(&Nat{limbs: T}, m)
nat.go#L968: return x.Mod(&Nat{limbs: T}, m)
nat.go#L975: return x.Mod(&Nat{limbs: T}, m)
nat.go#L1009: out.limbs[0] = 1
nat.go#L1128: size := max(len(a.limbs), len(m.limbs))
nat.go#L1132: A = NewNat().reset(len(m.limbs))
nat.go#L1133: A.limbs[0] = 1
nat.go#L1134: B := NewNat().reset(len(a.limbs))
nat.go#L1135: C := NewNat().reset(len(m.limbs))
nat.go#L1136: D := NewNat().reset(len(a.limbs))
nat.go#L1137: D.limbs[0] = 1
nat.go#L1201: size := len(a.limbs)
nat.go#L1202: aLimbs := a.limbs[:size]
nat.go#L1225: for i := len(x.limbs) - 1; i >= 0; i-- {
nat.go#L1226: x.limbs[i], r = bits.Div(r, x.limbs[i], y)